Meshing of Hexagons into Convex Quadrilaterals

نویسندگان

  • Nemanja Petrovic
  • Branko Kolundzija
چکیده

Efficient electromagnetic analysis of the composite metallic and dielectric structures in the frequency domain based on the Method of Moments applied to the Surface Integral Equations is provided, if building blocks have the form of bilinear surfaces (in particular, flat quads), and if analysis is supported by the higher order basis functions. Heterogenous surfaces of many 3D structures can be easily represented as a combination of connected non-overlapping polygons. Subdivision of the polygons into the minimal number of mutually connected flat quads of good shape is based on subdivision of the hexagons into the convex quads, with possible addition of new nodes only in the interior of the hexagons. We classified hexagons into 46 classes and for each class we found the subdivision scheme. We demonstrated that all subdivision schemes can be unified into four “cut and try” algorithms. The effectiveness of the approach is illustrated on a typical example. This method is implemented in the software tool for antenna design [6].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planar Point Sets with a Small Number of Empty Convex Polygons

A subset A of a finite set P of points in the plane is called an empty polygon, if each point of A is a vertex of the convex hull of A and the convex hull of A contains no other points of P . We construct a set of n points in general position in the plane with only ≈ 1.62n empty triangles, ≈ 1.94n empty quadrilaterals, ≈ 1.02n empty pentagons, and ≈ 0.2n empty hexagons.

متن کامل

On the number of disjoint convex quadrilaterals for a planar point set

For a given planar point set P , consider a partition of P into disjoint convex polygons. In this paper, we estimate the maximum number of convex quadrilaterals in all partitions.  2001 Elsevier Science B.V. All rights reserved.

متن کامل

Convex developments of a regular tetrahedron

The best-known developments of a regular tetrahedron are an equilateral triangle and a parallelogram. Are there any other convex developments of a regular tetrahedron? In this paper we will show that there are convex developments of a regular tetrahedron having the following shapes: an equilateral triangle, an isosceles triangle, a right-angled triangle, scalene triangles, rectangles, parallelo...

متن کامل

Equilateral Convex Pentagons Which Tile the Plane

It is shown that an equilateral convex pentagon tiles the plane if and only if it has two angles adding to 180 o or it is the unique equilateral convex pentagon with Although the area of mathematical tilings has been of interest for a long time there is still much to be discovered. We do not even know which convex polygons tile the plane. Furthermore, for those polygons which do tile, new tilin...

متن کامل

Quadratic serendipity finite elements on polygons using generalized barycentric coordinates

We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon, our construction produces 2n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n(n + 1)/2 basis functions known to obtain quadratic convergence....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001